Large Matrix Inversion using State Space Techniques
نویسندگان
چکیده
A new computational technique is presented by which large structured matrices can be inverted. The specified matrix is viewed as the input-output operator of a time-varying system. Recently developed state space algorithms which apply to such systems are then used to compute a QR factorization first and subsequently the inverse of the matrix, starting from a state realization of the matrix. The new algorithms apply in principle to any matrix. They are efficient if the structure of the matrix is such that the number of states of its time-varying state realization is small in comparison to its dimensions.
منابع مشابه
Large-scale Inversion of Magnetic Data Using Golub-Kahan Bidiagonalization with Truncated Generalized Cross Validation for Regularization Parameter Estimation
In this paper a fast method for large-scale sparse inversion of magnetic data is considered. The L1-norm stabilizer is used to generate models with sharp and distinct interfaces. To deal with the non-linearity introduced by the L1-norm, a model-space iteratively reweighted least squares algorithm is used. The original model matrix is factorized using the Golub-Kahan bidiagonalization that proje...
متن کاملComputationally Efficient Blind Mmse Receivers for Long Code Wcmda Using Time-varying Systems Theory
UMTS systems will employ long-code wideband CDMA modulation schemes. Receivers for this system are for computational reasons usually based on simple matched-filter techniques, and hence suffer from multiaccess interference. Decorrelating RAKE and MMSE receivers do not have this problem but, until now, were considered as too complex, due to the inversion of a large code matrix. As is shown in th...
متن کاملMonte Carlo Matrix Inversion Policy Evaluation
In 1950, Forsythe and Leibler (1950) introduced a statistical technique for finding the inverse of a matrix by characterizing the elements of the matrix inverse as expected values of a sequence of random walks. Barto and Duff (1994) subsequently showed relations between this technique and standard dynamic programming and temporal differencing methods. The advantage of the Monte Carlo matrix inv...
متن کاملDetermination of a Matrix Function in the Form of f(A)=g(q(A)) Where g(x) Is a Transcendental Function and q(x) Is a Polynomial Function of Large Degree Using the Minimal Polynomial
Matrix functions are used in many areas of linear algebra and arise in numerical applications in science and engineering. In this paper, we introduce an effective approach for determining matrix function f(A)=g(q(A)) of a square matrix A, where q is a polynomial function from a degree of m and also function g can be a transcendental function. Computing a matrix function f(A) will be time- consu...
متن کاملTime-Varying Lossless Systems and the Inversion of Large Structured Matrices
Time-Varying Lossless Systems and the Inversion of Large Structured Matrices In the inversion of large matrices, direct methods might give undesired ‘unstable’ results. Valuable insight into the mechanism of this effect is obtained by viewing the matrix as the input-output operator of a time-varying system, which allows to translate ‘unstable’ into ‘anticausal’ but bounded inverses. Inner-outer...
متن کامل